Tree automata and separable sets of input variables
نویسندگان
چکیده
We introduce the separable sets of variables for trees and tree au-tomata. If a set Y of input variables is inseparable for a tree and an automaton then there a non empty family of distributive sets of Y. It is shown that if a tree t has " many " inseparable sets with respect to a tree automaton A then there is an effective way to reduce the complexity of A when running on t.
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملTree Automata and Essential Input Variables
We introduce the essential inputs (variables) for terms (trees) and tree automata. It is proved that if an input xi is essential for a tree t and an automaton A then there is a chain of subtrees connecting xi with the root of t such that xi is essential for each subtree belonging to this chain. There are investigations which treat some rules for removing and adding of fictive (non-essential) in...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملTree Automata and Essential Subtrees
Terms considered as trees are very useful tools for presentation and manipulation of different data structures in Computer Science and Information Technology. Any work of the computer over the trees, for instance as graphical user interface (menus of the different windows), XML documents, definitions and description of hierarchial objects in C++ or Java programming etc. can be considered as run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0702123 شماره
صفحات -
تاریخ انتشار 2007